Constrained Percolation in Two Dimensions

نویسندگان

  • ALEXANDER E. HOLROYD
  • ZHONGYANG LI
چکیده

We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and ergodicity conditions are imposed on its law. The proofs use new combinatorial techniques exploiting

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL

The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...

متن کامل

A crossing probability for critical percolation in two dimensions

Langlands et al. considered two crossing probabilities, π h and π hv , in their extensive numerical investigations of critical percolation in two dimensions. Cardy was able to find the exact form of π h by treating it as a correlation function of boundary operators in the Q → 1 limit of the Q state Potts model. We extend his results to find an analogous formula for π hv which compares very well...

متن کامل

Renormalization group study of a kinetically constrained model for strong glasses.

We derive a dynamic field theory for a kinetically constrained model, based on the Fredrickson-Andersen model, which we expect to describe the properties of an Arrhenius (strong) supercooled liquid at the coarse-grained level. We study this field theory using the renormalization group. For mesoscopic length and time scales, and for space dimension d>/=2 , the behavior of the model is governed b...

متن کامل

Continuum Percolation Thresholds in Two Dimensions

A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the connected clusters, and (in two dimensions) using exact values from conformal field theory for the probability, at the phase transition, that various kinds of wrap...

متن کامل

Improved Lower Bounds for the Critical Probability of Oriented-Bond Percolation in Two Dimensions

We present a coupled decreasing sequence of random walks on Z (X (i) . , i ∈ N) that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of “random walk in a strip ”,we construct an algorithm that generates an increasing sequence of lower bounds that converges to the critical probability of oriented-bond percolation. Numerical calculations of the first t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016